Compositional Verification of Object Creation with Interface Invariants ?

نویسندگان

  • Frank S. de Boer
  • Marcel Kyas
چکیده

We present a theory for reasoning compositionally about behavioural interfaces for class-based object-oriented programs. Our contribution is an axiomatic characterisation of unbounded object creation in terms of communication traces over the visible operations of a class (its signature). This involves an abstraction from the actual explicit creation of objects. We apply our proof method to the compositional verification of the Sieve of Eratosthenes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

überSpark: Enforcing Verifiable Object Abstractions for Automated Compositional Security Analysis of a Hypervisor

We present überSpark (üSpark), an innovative architecture for compositional verification of security properties of extensible hypervisors written in C and Assembly. üSpark comprises two key ideas: (i) endowing low-level system software with abstractions found in higher-level languages (e.g., objects, interfaces, function-call semantics for implementations of interfaces, access control on interf...

متن کامل

A Compositional Trace Logic for Behavioural Interface Specifications

We describe a compositional trace logic for behavioural interface specifications and corresponding proof rules for compositional reasoning. The trace logic is defined in terms of axioms in higher-order logic. This trace logic is applicable to any object-oriented programming language. We treat object creation without observing the explicit act of creation. We prove a soundness result of this app...

متن کامل

A Strategy for Efficiently Verifying Requirements Specifications Using Composition and Invariants

This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker or a theorem prover, uses known state invariants to prove state and transition invariants. Two proof rules are presented: a standard incremental proof rule analogous to Manna and Pnueli’s incremental proof rule and a c...

متن کامل

Robust and Compositional Verification of Object Capability Pa erns

In scenarios such as web programming, where code is linked together from multiple sources, object capability patterns (OCPs) provide an essential safeguard, enabling programmers to protect the private state of their objects from corruption by unknown and untrusted code. However, the bene ts of OCPs in terms of program veri cation have never been properly formalized. In this paper, building on t...

متن کامل

Compositional Verification of a Baby Virtual Memory Manager

A virtual memory manager (VMM) is a part of an operating system that provides the rest of the kernel with an abstract model of memory. Although small in size, it involves complicated and interdependent invariants that make monolithic verification of the VMM and the kernel running on top of it difficult. In this paper, we make the observation that a VMM is constructed in layers: physical page al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004